Problem Set 2 Solutions
نویسنده
چکیده
Problem 1. this needs to be fleshed out We will use 3 arrays A, B, and C. A will represent that actual array and hold the stored items in their stored positions. Arrays B and C will act as “checks” for which entries of A are truly initialized. B will contain a list, built up sequentially from position 0, of all entries of A that have been filled. We use a “length” variable i to keep track of the number of entries in B. Each time we fill a new position k in A, we store the value k at B[i], then increment i. Array C will “index” Array 2. When we store k at B[i], we store i at C[k]. Now, when we want to check whether position k is full, we look at C[k] to find out where in B the value k should be stored. If C[k] ≥ i then it must be garbage meaning k is empty. If C[k] < i then we check if B[C[k]] = k, in which case we have proof that position k is full; if B[C[k]] has any other value then C[k] is garbage meaning position k is empty.
منابع مشابه
Characterization of efficient points of the production possibility set under variable returns to scale in DEA
We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...
متن کاملWell-dispersed subsets of non-dominated solutions for MOMILP problem
This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
متن کاملSolving Environmental/Economic Power Dispatch Problem by a Trust Region Based Augmented Lagrangian Method
This paper proposes a Trust-Region Based Augmented Method (TRALM) to solve a combined Environmental and Economic Power Dispatch (EEPD) problem. The EEPD problem is a multi-objective problem with competing and non-commensurable objectives. The TRALM produces a set of non-dominated Pareto optimal solutions for the problem. Fuzzy set theory is employed to extract a compromise non-dominated sol...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملAn Optimum Algorithm for Single Machine with Early/Tardy Cost
The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. 
 Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for ne...
متن کاملA two-phase free boundary problem for a semilinear elliptic equation
In this paper we study a two-phase free boundary problem for a semilinear elliptic equation on a bounded domain $Dsubset mathbb{R}^{n}$ with smooth boundary. We give some results on the growth of solutions and characterize the free boundary points in terms of homogeneous harmonic polynomials using a fundamental result of Caffarelli and Friedman regarding the representation of functions whose ...
متن کامل